Choosability of toroidal graphs without short cycles
نویسندگان
چکیده
Let G be a toroidal graph without cycles of a fixed length k, and l (G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant number: CUHK4165/01E (to L. C.); Contract grant sponsor: NSFC; Contract grant number: 10771197 (to W. W.); Contract grant sponsor: ZJNSFC; Contract grant number: Z6090150 (to W. W.); Contract grant sponsor: NSC97-2115-M-110-008-MY3 (to X. Z.). Journal of Graph Theory 2009 Wiley Periodicals, Inc.
منابع مشابه
On list vertex 2-arboricity of toroidal graphs without cycles of specific length
The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph. A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$, one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...
متن کاملGroup edge choosability of planar graphs without adjacent short cycles
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.
متن کاملChoosability and edge choosability of planar graphs without five cycles
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.
متن کاملOn Choosability with Separation of Planar Graphs with Forbidden Cycles
We study choosability with separation which is a constrained version of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k, d)-choosable if there exists an L-coloring of G for every (k, d)-list assignment L. This...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 65 شماره
صفحات -
تاریخ انتشار 2010